Polynomial functions are refinable
نویسنده
چکیده
The scope of refinable functions in wavelet theory is focused to localized functions. In our paper we like to widen that scope, in particular we show that all polynomial functions are refinable. This may yield an interesting notion of convolution of polynomials.
منابع مشابه
How to Refine Polynomial Functions
Refinable functions are functions that are in a sense self-similar: If you add shrunken translates of a refinable function in a weighted way, then you obtain that refinable function again. For instance, see Figure 1 for how a quadratic B-spline can be decomposed into four small B-splines and how the so called Daubechies-2 generator function is decomposed into four small variants of itself. All ...
متن کاملThe Minimal Degree of Solutions to Polynomial Equations Used for the Construction of Refinable Functions
Refinable functions, whose integer shifts interpolate the integer grid, provide favorable sampling formulas. Solutions to polynomial equations have been used in literature to construct such desirable refinable functions in the uniand multivariate setting. Polynomial solutions with minimal total and minimal maximum degree are seeked since the degree induces an upper bound on the size of the refi...
متن کاملFramelets with Many Vanishing Moments
We study tight wavelet frames associated with given refinable functions which are obtained with the unitary extension principles. All possible polynomial symbols generating refinable functions and admitting framelets with a given number of vanishing moments are found. We also consider constructions of (anti)symmetric framelets generated by a symmetric refinable function. We give a few examples ...
متن کاملExplicit Construction of Framelets
We study tight wavelet frames associated with given refinable functions which are obtained with the unitary extension principles. All possible solutions of the corresponding matrix equations are found. It is proved that the problem of the extension may be always solved with two framelets. In particular, if symbols of the refinable functions are polynomials (rational functions), then the corresp...
متن کاملWavelet Bi-frames with few Generators from Multivariate Refinable Functions
Using results on syzygy modules over a multivariate polynomial ring, we are able to construct compactly supported wavelet bi-frames with few generators from almost any pair of compactly supported multivariate refinable functions. In our examples, we focus on wavelet bi-frames whose primal and dual wavelets are both derived from one box spline function. Our wavelet bi-frames have fewer generator...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1012.2453 شماره
صفحات -
تاریخ انتشار 2010